Two- and three-dimensional firing-squad synchronization problems
نویسندگان
چکیده
منابع مشابه
On Formulations of Firing Squad Synchronization Problems
We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulat...
متن کاملVarious Solutions to the Firing Squad Synchronization Problems
We present different classes of solutions to the Firing Squad Synchronization Problem on networks of different shapes. The nodes are finite state processors that work at unison discrete steps. The networks considered are the line, the ring and the square. For all of these models we have considered one and two-way communication modes and also constrained the quantity of information that adjacent...
متن کاملThe Firing Squad Synchronization Problems for Number Patterns on a Seven-Segment Display and Segment Arrays
Citation IEICE transactions on information and systems, 93 SUMMARY The Firing Squad Synchronization Problem (FSSP), one of the most well-known problems related to cellular automata, was originally proposed by Myhill in 1957 and became famous through the work of Moore [1]. The first solution to this problem was given by Minsky and McCarthy [2] and a minimal time solution was given by Goto [3]. A...
متن کاملNew Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems
We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take ec +5 and 6ec +7 steps, respectively, where ec is the eccentricity of the commander cell of the dag or digraph underlying these P systems. The first and fast solution is based on a novel proposal, which dynam...
متن کاملFiring Squad Synchronization Problem in Reversible Cellular Automata
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA). First we proved that, in the case of RCA, there is no solution under the usual condition for FSSP where the firing state is only one. So we defined a little weaker condition suitable for RCA in which finite number of firing states are allowed. We showed that Minsky’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)80055-0